Algorithms for Olfactory Search across Species
نویسندگان
چکیده
منابع مشابه
SYMBIOTIC ORGANISMS SEARCH AND HARMONY SEARCH ALGORITHMS FOR DISCRETE OPTIMIZATION OF STRUCTURES
In this work, a new hybrid Symbiotic Organisms Search (SOS) algorithm introduced to design and optimize spatial and planar structures under structural constraints. The SOS algorithm is inspired by the interactive behavior between organisms to propagate in nature. But one of the disadvantages of the SOS algorithm is that due to its vast search space and a large number of organisms, it may trap i...
متن کاملOlfactory consciousness across disciplines
Although vision is the de facto model system of consciousness research, studying olfactory consciousness has its own advantages, as this collection of articles emphatically demonstrates. One advantage of olfaction is its computational and phenomenological simplicity, which facilitates the identification of basic principles. Other researchers study olfactory consciousness not because of its simp...
متن کاملComparison of Simulated Annealing, Genetic, and Tabu Search Algorithms for Fracture Network Modeling
The mathematical modeling of fracture networks is critical for the exploration and development of natural resources. Fractures can help the production of petroleum, water, and geothermal energy. They also greatly influence the drainage and production of methane gas from coal beds. Orientation and spatial distribution of fractures in rocks are important factors in controlling fluid flow. The obj...
متن کاملComparison of particle swarm optimization and tabu search algorithms for portfolio selection problem
Using Metaheuristics models and Evolutionary Algorithms for solving portfolio problem has been considered in recent years.In this study, by using particles swarm optimization and tabu search algorithms we optimized two-sided risk measures . A standard exact penalty function transforms the considered portfolio selection problem into an equivalent unconstrained minimization problem. And in final...
متن کاملAlgorithms for Motif Search
University of Connecticut 1.1 Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-1 1.2 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-1 1.3 Algorithms for Planted Motif Search . . . . . . . . . . . . . . . 1-2 A Probabilistic Analysis • The WINNOWER and SP-STAR Algorithms • Pattern Br...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Neuroscience
سال: 2018
ISSN: 0270-6474,1529-2401
DOI: 10.1523/jneurosci.1668-18.2018